SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
نویسندگان
چکیده
منابع مشابه
the problem of divine hiddenness
این رساله به مساله احتجاب الهی و مشکلات برهان مبتنی بر این مساله میپردازد. مساله احتجاب الهی مساله ای به قدمت ادیان است که به طور خاصی در مورد ادیان ابراهیمی اهمیت پیدا میکند. در ادیان ابراهیمی با توجه به تعالی خداوند و در عین حال خالقیت و حضور او و سخن گفتن و ارتباط شهودی او با بعضی از انسانهای ساکن زمین مساله ای پدید میاید با پرسشهایی از قبیل اینکه چرا ارتباط مستقیم ویا حداقل ارتباط وافی به ب...
15 صفحه اولDNA Solution of a Graph Coloring Problem
The graph-theoretic parameter that has probably received the most attention over the years is the chromatic number. As is well-known, the coloring problem is an NP-Complete problem. In this paper, it has been solved by means of molecular biology techniques. The algorithm is highly parallel and has satisfactory fidelity. This work shows further evidence for the ability of DNA computing to solve ...
متن کاملHigher-Dimensional Analogues of the Map Coloring Problem
After a brief discussion of the history of the problem, we propose a generalization of the map colouring problem to higher dimensions. The map colouring problem was originally posed by Francis Guthrie in 1852. It asks for the minimum number of colours required to colour all possible maps (real or imagined) if one wishes to ensure that neighbouring countries receive different colours. Clearly on...
متن کاملAn Analysis of Solution Properties of the Graph Coloring Problem
This paper presents an analysis of solutions of the Graph Coloring Problem (GCP). Given an undirected graph G(V,E) with a vertex set V and an edge set E, the goal of GCP is to find a color assignment to every vertex in V such that any pair of adjacent (or connected) vertices receive different colors, and the total number of colors required for the feasible color assignment be minimized; the sma...
متن کاملThe Map-Coloring Game
1. INTRODUCTION. Suppose that Alice wants to color a planar map using four colors in a proper way, that is, so that any two adjacent regions get different colors. Despite the fact that she knows for certain that it is eventually possible, she may fail in her first attempts. Indeed, there are usually many proper partial colorings not extend-able to proper colorings of the whole map. Thus, if she...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the National Academy of Sciences
سال: 1968
ISSN: 0027-8424,1091-6490
DOI: 10.1073/pnas.60.2.438